Morton ordering of 2D arrays for efficient access to hierarchical memory

This paper investigates the recursive Morton ordering of two-dimensional arrays as an efficient way to access hierarchical memory across a range of heterogeneous computer platforms, ranging from many-core devices, multicore processor, clusters, and distributed environments. A brief overview of previous research in this area is given, and algorithms that make use of Morton ordering are described. These are then used to demonstrate the efficiency of the Morton ordering approach by performance experiments on different processors. In particular, timing results are presented for matrix multiplication, Cholesky factorisation, and fast Fourier transform algorithms. The use of the Morton ordering approach leads naturally to algorithms that are recursive, and exposes parallelism at each level of recursion. Thus, the approach advocated in this talk not only provides convenient and efficient access to hierarchical memory, but also provides a basis for exploiting parallelism.